Even Pairs and Prism Corners in Square-Free Berge Graphs
نویسندگان
چکیده
Let G be a Berge graph such that no induced subgraph is a 4-cycle or a line-graph of a bipartite subdivision of K4. We show that every such graph G either is a complete graph or has an even pair.
منابع مشابه
Even Pairs and Prism Corners in Berge Graphs
Let G be a Berge graph such that no induced subgraph is a 4-cycle or a line-graph of a bipartite subdivision of K4. We show that every such graph G either is a complete graph or has an even pair.
متن کاملAlgorithms for Square-3PC(., .)-Free Berge Graphs
We consider the class of graphs containing no odd hole, no odd antihole, and no configuration consisting of three paths between two nodes such that any two of the paths induce a hole, and at least two of the paths are of length 2. This class generalizes clawfree Berge graphs and square-free Berge graphs. We give a combinatorial algorithm of complexity O(n) to find a clique of maximum weight in ...
متن کاملColoring square-free Berge graphs
We consider the class of Berge graphs that do not contain a chordless cycle of length four. We present a purely graph-theoretical algorithm that produces an optimal coloring in polynomial time for every graph in that
متن کاملDecomposition of even-hole-free graphs with star cutsets and 2-joins
In this paper we consider the class of simple graphs defined by excluding, as inducedsubgraphs, even holes (i.e. chordless cycles of even length). These graphs are known aseven-hole-free graphs. We prove a decomposition theorem for even-hole-free graphs, thatuses star cutsets and 2-joins. This is a significant strengthening of the only other pre-viously known decomposition of ev...
متن کاملMinimal k-rankings for prism graphs
We determine rank numbers for the prism graph P 2 ×C n (P 2 being the connected two-node graph and C n a cycle of length n) and for the square of an even cycle.
متن کامل